3D rectilinear motion planning with minimum bend paths
نویسندگان
چکیده
Computing rectilinear shortest paths in two dimensions has been solved optimally using a number of different techniques. A variety of related problems have been solved, including minimizing the number of bends in the path, the total rectilinear distance, or some combination of both. However, solutions to the 3D versions of these problems are less common. We propose a solution to the 3D minimum-bend path problem, which has theoretical as well as practical interest. Applications include motion planning problems where straight line motion is preferred over taking arbitrary turns. We employ our results in motion planning for self-repair in self-reconfigurable robots.
منابع مشابه
Rectilinear Path Problems among Rectilinear Obstacles Revisited
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
متن کاملThe Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
Smallest rectilinear paths are rectilinear paths with a minimum number of bends and with a minimum length, simultaneously. In this paper, given two pairs of terminals within a rectilinear polygon, we derive an algorithm to find a pair of noncrossing rectilinear paths within the polygon such that the total number of bends and the total length are both minimized. Although a smallest rectilinear p...
متن کاملAn Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set P of h pairwise-disjoint rectilinear polygonal obstacles with a total of n vertices in the plane, a minimumlink rectilinear path between two points is a rectilinear path that avoids all obstacles with ...
متن کاملBicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...
متن کامل3D Motion Planning for Robot-Assisted Active Flexible Needle Based on Rapidly-Exploring Random Trees
An active flexible needle is a self-actuating needle that can bend in the tissue and reach the clinical targets while avoiding anatomic obstacles. In robot-assisted needlebased medical procedures, motion planning is a vital aspect of operations. It is challenging due to the nonholonomic motion of the needle and the presence of anatomic obstacles and sensitive organs that must be avoided. We pro...
متن کامل